Binary Prime Tableau Sequences
نویسندگان
چکیده
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT sequence of rank p is obtained from numbers arranged in a tableau with p columns where primes are marked off until each column has at least one prime and where the column entries are added modulo 2. We also examine the dual to the PT sequences obtained by adding the rows of the tableau. It is shown that PT sequences have excellent autocorrelation properties.
منابع مشابه
LegTraceRep.tex, 25.8.99, M.G.Parker Legendre and Twin Prime Sequences: Trace and Multi-Rate Representations
Trace representations are presented for all binary Legendre sequences and Twin-Prime sequences, and an alternative multi-rate construction is given for the Twin-Prime sequence.
متن کاملOn the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities
Klapper [1] showed that there are binary sequences of period q − 1(q is a prime power p, p is an odd prime) with the maximal possible linear complexity q−1 when considered as sequences over GF (2), while the sequences have very low linear complexities when considered as sequences over GF (p). This suggests that the binary sequences with high GF (2) linear complexities and low GF (p) linear comp...
متن کاملThe merit factor of binary sequences related to difference sets
Long binary sequences related to cyclic difference sets are investigated. Among all known constructions of cyclic difference sets we show that only sequences constructed from Hadamard difference sets can have an asymptotic nonzero merit factor. Maximal length shift register sequences, Legendre, and twin-prime sequences are all constructed from Hadamard difference sets. We prove that the asympto...
متن کاملTesting Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications
This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less than one million. The conjecture has also been tested for ternary representation with similar results. Some applications of this result to cryptography are discussed. Introduction In a note nearly 25 years ago, Kak conjectured [1] that...
متن کاملNew Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences
Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.08718 شماره
صفحات -
تاریخ انتشار 2017